Modifikasi Protokol Tanda Tangan Digital ElGamal Menggunakan General Linear Group
نویسندگان
چکیده
منابع مشابه
An Implicit ELGamal Digital Signature Scheme
This paper introduced a detail ElGamal digital signature scheme, and mainly analyzed the existing problems of the ElGamal digital signature scheme. Then improved the scheme according to the existing problems of ElGamal digital signature scheme, and proposed an implicit ElGamal type digital signature scheme with the function of message recovery. As for the problem that message recovery not being...
متن کاملA New Digital Signature Algorithm Similar to ELGamal Type
Application of digital signature technology becomes more extensive, but many exposed digital signature algorithms have increasingly revealed some shortcomings and deficiencies. Aiming directly at the frequently used digital signature technologies, which are weak to Substitution Attack and Homeostasis Attack, the authors perform the hash transformation on messages before signature. Then, a hash ...
متن کاملON THE SZEGED INDEX OF NON-COMMUTATIVE GRAPH OF GENERAL LINEAR GROUP
Let $G$ be a non-abelian group and let $Z(G)$ be the center of $G$. Associate with $G$ there is agraph $Gamma_G$ as follows: Take $Gsetminus Z(G)$ as vertices of$Gamma_G$ and joint two distinct vertices $x$ and $y$ whenever$yxneq yx$. $Gamma_G$ is called the non-commuting graph of $G$. In recent years many interesting works have been done in non-commutative graph of groups. Computing the clique...
متن کاملElGamal Digital Signature Algorithm of Adding a Random Number
As for the problem that ElGamal digital signature scheme’s security is constantly being challenged and increasingly becomes increasingly serious, an improved ElGamal digital signature algorithm is proposed. As the original ElGamal algorithm has its own security disadvantages that only one random number is used, in order to improve its security, the scheme presented in this paper improved this d...
متن کاملModified ElGamal over RSA Digital Signature Algorithm (MERDSA)
Generally digital signature algorithms are based on a single hard problem like prime factorization problem, discrete logarithm problem, elliptic curve problem. If one finds solution of this single hard problem then these digital signature algorithms will no longer be secured and due to large computational power, this may be possible in future. There are many other algorithms which are based on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Matematika Integratif
سال: 2019
ISSN: 2549-9033,1412-6184
DOI: 10.24198/jmi.v15.n1.20960.39-44